A classification result on weighted {δvμ+1, δvμ;N, p3}-minihypers
نویسندگان
چکیده
We classify all {δvμ+1, δvμ;N, p3}-minihypers, δ ≤ 2p − 4p, p = p0 ≥ 11, h ≥ 1, for a prime number p0 ≥ 7, with excess e ≤ p − 4p when μ = 1 and with excess e ≤ p + p when μ > 1. For N ≥ 4, p non-square, such a minihyper is a sum of μdimensional spaces PG(μ, p) and of at most one (possibly projected) subgeometry PG(3μ + 2, p); except for one special case when μ = 1. When p is a square, also (possibly projected) Baer subgeometries PG(2μ+ 1, p3/2) can occur.
منابع مشابه
On weighted { δv μ + 1 , δv μ ; k − 1 , q } - minihypers , q square
Weighted minihypers have recently received a lot of attention. They originated as geometrical equivalents of linear codes meeting the Griesmer bound, but have also been investigated for their importance in solving geometrical problems. Storme characterized weighted {δ(q+1), δ; k−1, q}-minihypers, q square, as a sum of lines and Baer subgeometries PG(3, √ q), provided δ is sufficiently small. Th...
متن کاملA characterisation result on a particular class of non-weighted minihypers
We present a characterisation of { 1(q+1)+ 0, 1;n, q}-minihypers, q square, q = ph, p > 3 prime, h ≥ 2, q ≥ 1217, for 0+ 1 < q 7/12 2 − q1/4 2 . This improves a characterisation result of S. Ferret and L. Storme [6], involving more Baer subgeometries contained in the minihyper.
متن کاملNew classification results for a certain class of weighted minihypers
Minihypers were introduced for their relation with linear codes meeting the Griesmer bound. Results on minihypers have therefore important applications in coding theory. On the other hand, minihypers are nice geometrical structures since they are a generalization of blocking sets, which have been studied a lot. Therefore also minihypers deserve to be studied from a purely geometrical point of v...
متن کاملCharacterization results on weighted minihypers and on linear codes meeting the Griesmer bound
We present characterization results on weighted minihypers. We prove the weighted version of the original results of Hamada, Helleseth, and Maekawa. Following from the equivalence between minihypers and linear codes meeting the Griesmer bound, these characterization results are equivalent to characterization results on linear codes meeting the Griesmer bound. 1. Linear codes meeting the Griesme...
متن کاملA note on a result by Hamada on minihypers
Hamada [Bull. Osaka Women’s Univ. 24:1–47, 1985; Discrete Math. 116:229-268, 1993] characterized the non-weighted minihypers having parameters ( ∑h i=1 vλi+1, ∑h i=1 vλi ; t, q) with t > λ1 > λ2 > · · · > λh ≥ 0. This result has been generalized in [Des. Codes Cryptogr. 45:123-138,2007] where it was proved that a weighted ( ∑h i=1 vλi+1, ∑h i=1 vλi ; t, q)-minihyper F, with k − 1 > λ1 > λ2 > · ...
متن کامل